- algorithm module
- алгоритмдік дарабөлшек
Ақпараттану мен есептеу техникасы терминдерінің қытайша-қазақша-ағылшынша-орысша сөздігі. - Үрімжі: Шынжаң ғылым-техника баспасы. Ережепұлы Қ.. 2010.
algorithm module
Look at other dictionaries:
Module conditionnel d'accès — Interface commune L’interface commune (ou sigle CI de l anglais Common Interface) désigne un système relatif au « contrôle d accès » des programmes et services payants ou optionnels exploité principalement par la norme DVB. Il exploite… … Wikipédia en Français
Module d'accès conditionnel — Interface commune L’interface commune (ou sigle CI de l anglais Common Interface) désigne un système relatif au « contrôle d accès » des programmes et services payants ou optionnels exploité principalement par la norme DVB. Il exploite… … Wikipédia en Français
A* search algorithm — In computer science, A* (pronounced A star ) is a best first, graph search algorithm that finds the least cost path from a given initial node to one goal node (out of one or more possible goals). It uses a distance plus cost heuristic function… … Wikipedia
Subscriber Identity Module — Simcard redirects here. For the brand name medication, see Simvastatin. A typical SIM Card … Wikipedia
Cis-regulatory module — (CRM) is a stretch of DNA, usually 100 1000 DNA base pairs in length,[1] where a number of transcription factors can bind and regulate expression of nearby genes. One cis regulatory element can regulate several genes,[2] and conversely, one gene… … Wikipedia
Selection algorithm — In computer science, a selection algorithm is an algorithm for finding the kth smallest number in a list (such a number is called the kth order statistic). This includes the cases of finding the minimum, maximum, and median elements. There are… … Wikipedia
Levenberg–Marquardt algorithm — In mathematics and computing, the Levenberg–Marquardt algorithm (LMA)[1] provides a numerical solution to the problem of minimizing a function, generally nonlinear, over a space of parameters of the function. These minimization problems arise… … Wikipedia
Nondeterministic algorithm — In computer science, a nondeterministic algorithm is an algorithm that can exhibit different behaviors on different runs, as opposed to a deterministic algorithm. There are several ways an algorithm may behave differently from run to run. A… … Wikipedia
Floyd–Warshall algorithm — In computer science, the Floyd–Warshall algorithm (sometimes known as the WFI Algorithm or Roy–Floyd algorithm, since Bernard Roy described this algorithm in 1959) is a graph analysis algorithm for finding shortest paths in a weighted, directed… … Wikipedia
Boyer–Moore string search algorithm — The Boyer–Moore string search algorithm is a particularly efficient string searching algorithm, and it has been the standard benchmark for the practical string search literature. [Hume and Sunday (1991) [Fast String Searching] SOFTWARE PRACTICE… … Wikipedia
Quine–McCluskey algorithm — The Quine–McCluskey algorithm (or the method of prime implicants) is a method used for minimization of boolean functions which was developed by W.V. Quine and Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular… … Wikipedia
